From Conditional to Unconditional Rewriting
نویسنده
چکیده
An automated technique to translate conditional rewrite rules into unconditional ones is presented, which is suitable to implement, or compile, conditional rewriting on top of much simpler and easier to optimize unconditional rewrite systems. An experiment performed on world’s fastest conditional rewriting engines shows that speedups for conditional rewriting of an order of magnitude can already be obtained by applying the presented technique as a front-end transformation.
منابع مشابه
On the confluence of λ-calculus with conditional rewriting
The confluence of untyped λ-calculus with unconditional rewriting is now well understood. In this paper, we investigate the confluence of λ-calculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Müller and Dougherty for unconditional rewriting. Two cases are considered, whether betareduction is allo...
متن کاملComputationally Equivalent Elimination of Conditions
An automatic and easy to implement transformation of conditional term rewrite systems into computationally equivalent unconditional term rewrite systems is presented. No special support is needed from the underlying unconditional rewrite engine. Since unconditional rewriting is more amenable to parallelization, our transformation is expected to lead to efficient concurrent implementations of re...
متن کاملUnravelings and Ultra-properties
Conditional rewriting is universally recognized as being much more complicated than unconditional rewriting In this paper we study how much of conditional rewriting can be automatically inferred from the simpler theory of unconditional rewriting We introduce a new tool called unraveling to automatically translate a conditional term rewriting system CTRS into a term rewriting system TRS An unrav...
متن کاملOperational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures
While ordinary conditional rewrite systems are more elegant than unconditional ones, they still have limited expressive power since semantic data structures, such as sets or multisets, cannot be modeled elegantly. Extending our work presented at RTA 2008 [9], the present paper defines a class of conditional rewrite systems that allows the use of semantic data structures and supports built-in na...
متن کاملCompletion of Unraveled Term Rewriting Systems toward Program Inversion of Injective Functions
Given a constructor term rewriting system defining injective functions, the inversion compiler proposed by Nishida, Sakai and Sakabe generates a confluent conditional term rewriting system, and unravels the conditional system into an unconditional term rewriting system. In general, the unconditional system is not confluent and thus not computationally equivalent to the conditional system. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004